منابع مشابه
Sublinear Graph Approximation Algorithms
Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32 Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover siz...
متن کاملSublinear-time Algorithms
In this paper we survey recent advances in the area of sublinear-time algorithms.
متن کاملSublinear Time Algorithms
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.
متن کاملLecture Notes 8 : Sublinear Algorithms
This result was originally attributed to Nemhauser, Wolsey, and Fisher [4], but they only claimed this result without a proof. Jenkyns was the first to give a full proof of this result. We will discuss a simplified proof due to Calinescu et al [1]. Proof. If we have (α+1)-approximation for incremental oracle then approximation bound is αk+1. Let β ≤ 1 and β = 1/α. Then we want f(Greedy) ≥ β k +...
متن کاملSeminar on Sublinear Time Algorithms
Proof Idea For any two specific inputs there exists an algorithm that is adapted to these inputs. For example, if we take the two inputs x = (1, 2, ..., n) as a “yes” example, and y = (1, 1, 2, 2, ..., n, n, n + 1, n + 2, ..., n(1 − )) as a “no” example, then an algorithm that checks the second coordinate can distinguish between them. Therefore, we look on distributions over inputs. We need two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2005
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s009753970444572x